A Genetic Algorithm for the Waitable Time-Varying Multi-Depot Green Vehicle Routing Problem

In an era where people in the world are concerned about environmental issues, companies must reduce distribution costs while minimizing pollution generated during process. For today’s multi-depot problem, a mixed-integer programming model is proposed this paper to minimize all incurred entire transportation process, considering impact of time-varying speed, loading, and waiting time on costs. Time directional; hence, problems considered study modeled based asymmetry, making problem-solving more complex. This proposes genetic algorithm combined with simulated annealing solve issue, inner outer layers solving for optimal path planning respectively. The mutation operator replaced layer by neighbor search approach using solution acceptance mechanism similar avoid local optimum solution. extends problem (vehicle-routing problem) provides alternative networks.